Projection-tree reduced-order modeling for fast N-body computations
نویسندگان
چکیده
This work presents a data-driven reduced-order modeling framework to accelerate the computations of $N$-body dynamical systems and their pair-wise interactions. The proposed differs from traditional acceleration methods, like Barnes-Hut method, which requires online tree building state space, or fast-multipole rigorous $a$ $priori$ analysis governing kernels building. Our approach combines hierarchical decomposition, dimensional compression via least-squares Petrov-Galerkin (LSPG) projection, hyper-reduction by way Gauss-Newton with approximated tensor (GNAT) approach. resulting $projection-tree$ reduced order model (PTROM) enables drastic reduction in operational count complexity constructing sparse hyper-reduced pairwise interactions system. As result, presented is capable achieving an that independent $N$, number bodies numerical domain. Capabilities PTROM method are demonstrated on two-dimensional fluid-dynamic Biot-Savart kernel within parametric reproductive setting. Results show over 2000$\times$ wall-time speed-up respect full-order model, where increases $N$. solution delivers quantities interest errors less than 0.1$\%$ model.
منابع مشابه
Order-N projection method for first-principles computations of electronic quantities and Wannier functions
We present a generalized projection-based order-N method which is applicable within nonorthogonal basis sets of spatially localized orbitals. The projection to the occupied subspace of a Hamiltonian, performed by means of a Chebyshev-polynomial representation of the density operator, allows the nonvariational computation of band-structure energies, density matrices, and forces for systems with ...
متن کاملFast Tree-Based Redistancing forLevel Set Computations
Level set methods for moving interface problems require efficient techniques for transforming an interface to a globally defined function whose zero set is the interface, such as the signed distance to the interface. This paper presents efficient algorithms for this “redistancing” problem. The algorithms use quadtrees and triangulation to compute global approximate signed distance functions. A ...
متن کاملOn Fast and Approximate Attack Tree Computations
In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algorithm for fast approximate computations. Our experiments show that for attack trees having less than 30 leaves, the confidence level of 89% can be achieved within 2 seconds using this algorithm. The approximation scales very we...
متن کامل"On-the-fly" Parameter Identification for Dynamic Systems Control, Using Interval Computations and Reduced-Order Modeling
Computer simulations of dynamic systems are really important to better understand some processes or phenomena without having to physically execute them, and/or to make offline decisions, or decisions that do not need immediate, “on-the-fly” answers in general. However, given a set of equations describing a dynamic phenomenon, wouldn’t it be nice to be able to exploit them more? Instead of simul...
متن کاملImproved accuracy and acceleration of variational order-N electronic-structure computations by projection techniques
We have performed minimizations of the order-N energy functional of Ordejón et al. @Phys. Rev. B 51, 1456 ~1995!# in models of fourfold-coordinated amorphous carbon containing 512 and 4096 atoms using the firstprinciple local-orbital Hamiltonian of Sankey and Niklewski. The total time for performing the minimization can be significantly reduced by directly projecting the initial functions to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2022
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2022.111141